On some factorization problems
نویسندگان
چکیده
We consider three notions of factorization arising in different frameworks: factorizing languages, factorization of the natural numbers, factorizing codes. A language X ⊆ A∗ is called factorizing if there exists a language Y ⊆ A∗ such that XY = A∗ and the product is unambiguous. This is a decidable property for recognizable languages X . If we consider the particular case of unary alphabets, we prove that finite factorizing languages can be constructed by using Krasner factorizations. Moreover, we extend Krasner’s algorithm to factorizations of An. We introduce a class of languages, the strong factorizing languages, which are related to the factorizing codes, introduced by Schützenberger. We characterize strong factorizing languages having three words.
منابع مشابه
$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملOn semi weak factorization structures
In this article the notions of semi weak orthogonality and semi weak factorization structure in a category $mathcal X$ are introduced. Then the relationship between semi weak factorization structures and quasi right (left) and weak factorization structures is given. The main result is a characterization of semi weak orthogonality, factorization of morphisms, and semi weak factorization structur...
متن کاملThe Factorization Problem: Some Known Results and Open Questions
This is a concise survey of some results and open problems concerning Wiener-Hopf factorization and almost periodic factorization of matrix functions. Several classes of discontinuous matrix functions are considered. Also sketched is the abstract framework which unifies the two types of factorization. Mathematics Subject Classification (2010). Primary 47A68; Secondary 30E25, 43A75, 45F15, 47B35 .
متن کامل